A prototypical OWL Full Reasoner based on First-Order Reasoning
نویسنده
چکیده
We report on our ongoing endeavour to create a prototypical reasoning system for the OWL 2 Full ontology language and several of its sublanguages, including RDFS and the OWL 2 RL/RDF Rules. Among the languages specified by the W3C OWL 2 standard, OWL 2 Full is the most expressive one, and several other languages, such as RIF and SPARQL 1.1, have dependencies on OWL 2 Full, but to date no reasoner has been implemented for this language. The basic idea underlying our system is to translate the semantics specification of OWL 2 Full and the RDF graphs representing the input ontologies into first-order logic formulae, and to apply first-order reasoners to this axiomatisation to perform one of the supported reasoning tasks: ontology consistency checking, entailment checking, or query answering. The paper explains the taken approach, summarizes the results of a recent evaluation of this approach, and gives an overview of the functionality, architecture and implementation of the reasoner.
منابع مشابه
Reasoning in the OWL 2 Full Ontology Language Using First-Order Automated Theorem Proving
OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language. Consistency and entailment checking are known to be undecidable for OWL 2 Full. We have translated a large fragment of the OWL 2 Full semantics into firstor...
متن کاملGraphScale: Adding Expressive Reasoning to Semantic Data Stores
We present GraphScale, a technology that empowers semantic data stores with OWL reasoning. It connects a given data store with any state of the art OWL reasoner. The underlying abstraction approach allows to efficiently perform a full materialization of the store based on sound and complete OWL 2 RL reasoning for high-performance querying.
متن کاملScalability via Parallelization of OWL Reasoning
Practical scalability of reasoning is an important premise for the adoption of semantic technologies in a real-world setting. Many highly effective optimizations for reasoning with expressive OWL ontologies have been invented and implemented over the last decades. This paper describes our approach for concurrent computation of the nondeterministic choices inherent to the OWL tableau reasoning p...
متن کاملA Platform for Reasoning with OWL-EL Knowledge Bases in a Peer-to-Peer Environment
Memory exhaustion is a common problem in tableau-based OWL reasoners, when reasoning with large ontologies. One possible solution is to distribute the reasoning task across multiple machines. In this paper, we present, as preliminary work, a prototypical implementation for distributing OWL-EL ontologies over a Peer-to-Peer network, and reasoning with them in a distributed manner. The algorithms...
متن کاملOptimizing SPARQL Query Answering over OWL Ontologies
The SPARQL query language is currently being extended by the World Wide Web Consortium (W3C) with so-called entailment regimes. An entailment regime defines how queries are evaluated under more expressive semantics than SPARQL’s standard simple entailment, which is based on subgraph matching. The queries are very expressive since variables can occur within complex concepts and can also bind to ...
متن کامل